Fast Generation of Approximate Blue Noise Point Sets
نویسندگان
چکیده
منابع مشابه
Fast Generation of Approximate Blue Noise Point Sets
Abstract Poisson-disk sampling is a popular sampling method because of its blue noise power spectrum, but generation of these samples is computationally very expensive. In this paper, we propose an efficient method for fast generation of a large number of blue noise samples using a small initial patch of Poisson-disk samples that can be generated with any existing approach. Our main idea is to ...
متن کاملFast Generation of Randomized Low-Discrepancy Point Sets
We introduce two novel techniques for speeding up the generation of digital (t, s)-sequences. Based on these results a new algorithm for the construction of Owen’s randomly permuted (t, s)−sequences is developed and analyzed. An implementation is available at http://www.mcqmc.org/Software.html.
متن کاملApproximate Matching of Curves to Point Sets
Let P be a polygonal curve in R of length n, and S be a point set of size k. The Curve/Point Set Matching problem consists of finding a polygonal curve Q on S such that the Fréchet distance from P is less than a given ε. We consider eight variations of the problem based on the distance metric used and the omittability and repeatability of the points. We provide closure to a recent series of com...
متن کاملGeneration of Blue Noise Arrays by Genetic
Halftoning or quantizing by means of a threshold array is simple, fast, and easily parallelized: a matrix of threshold values is tiled across the image and each output pixel is colored white if the image value exceeds the threshold value and is colored black otherwise. The computational eeciency and locality of the compare operation makes this technique suitable for applications in printing and...
متن کاملImproving spatial coverage while preserving the blue noise of point sets
We explore the notion of a Well-spaced Blue-noise Distribution (WBD) of points, which combines two desirable properties. First, the point distribution is random, as measured by its spectrum having blue noise. Second, it is well-spaced in the sense that the minimum separation distance between samples is large compared to the maximum coverage distance between a domain point and a sample, i.e. its...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2012
ISSN: 0167-7055
DOI: 10.1111/j.1467-8659.2012.03149.x